A new distribution problem of balls into urns, and how to color a graph by different-sized sets

摘要

Set-coloring a graph means giving each vertex a subset of a fixed color setso that no two adjacent subsets have the same cardinality. When the graph iscomplete one gets a new distribution problem with an interesting generatingfunction. We explore examples and generalizations.